|
In mathematics, the cycles of a permutation ''π'' of a finite set S correspond bijectively to the orbits of the subgroup generated by ''π'' acting on ''S''. These orbits are subsets of S that can be written as , such that :''π''(''c''''i'') = ''c''''i'' + 1 for ''i'' = 1, ..., ''l'' − 1, and ''π''(''c''''l'') = ''c''1. The corresponding cycle of ''π'' is written as ( ''c''1 ''c''2 ... ''c''''n'' ); this expression is not unique since ''c''1 can be chosen to be any element of the orbit. The size ''l'' of the orbit is called the length of the corresponding cycle; when ''l'' = 1, the single element in the orbit is called a fixed point of the permutation. A permutation is determined by giving an expression for each of its cycles, and one notation for permutations consist of writing such expressions one after another in some order. For example, let : be a permutation that maps 1 to 2, 6 to 8, etc. Then one may write :''π'' = ( 1 2 4 3 ) ( 5 ) ( 6 8 ) (7) = (7) ( 1 2 4 3 ) ( 6 8 ) ( 5 ) = ( 4 3 1 2 ) ( 8 6 ) ( 5 ) (7) = ... Here 5 and 7 are fixed points of ''π'', since ''π''(5)=5 and ''π''(7)=7. It is typical, but not necessary, to not write the cycles of length one in such an expression. Thus, π = (1 2 4 3)(6 8), would be an appropriate way to express this permutation. There are different ways to write a permutation as a list of its cycles, but the number of cycles and their contents are given by the partition of ''S'' into orbits, and these are therefore the same for all such expressions. == Counting permutations by number of cycles == The unsigned Stirling number of the first kind, ''s''(''k'', ''j'') counts the number of permutations of ''k'' elements with exactly ''j'' disjoint cycles. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Cycles and fixed points」の詳細全文を読む スポンサード リンク
|